Integrating Genetic Algorithm, Tabu Search and Simulated Annealing For Job Shop Scheduling Proble
نویسندگان
چکیده
منابع مشابه
Integrating Genetic Algorithm, Tabu Search and Simulated Annealing For Job Shop Scheduling Proble
Job Shop Scheduling Problem (JSSP) is an optimization problem in which ideal jobs are assigned to resources at particular times. In recent years many attempts have been made at the solution of JSSP using a various range of tools and techniques such as Branch and Bound and Heuristics algorithms. This paper proposed a new algorithm based on Genetic Algorithm (GA), Tabu Search (TS) and Simulated A...
متن کاملIntegrating Genetic Algorithm, Tabu Search Approach for Job Shop Scheduling
This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of the proposed algorithm is derived from Genetic Algorithms. Most of the scheduling problems require either exponential time or space to generate an optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and it is a NP-compl...
متن کاملA Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations
In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...
متن کاملAn Improved Tabu Search Algorithm for Job Shop Scheduling Problem Trough Hybrid Solution Representations
Job shop scheduling problem (JSP) is an attractive field for researchers and production managers since it is a famous problem in many industries and a complex problem for researchers. Due to NP-hardness property of this problem, many meta-heuristics are developed to solve it. Solution representation (solution seed) is an important element for any meta-heuristic algorithm. Therefore, many resear...
متن کاملFocused Simulated Annealing Search: an Application to Job-shop Scheduling
This paper presents a simulated annealing search procedure developed to solve job shop scheduling problems simultaneously subject to tardiness and inventory costs. The procedure is shown to signi cantly increase schedule quality compared to multiple combinations of dispatch rules and release policies, though at the expense of intense computational e orts. A meta-heuristic procedure is developed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/7348-0283